An integrated proof language for imperative programs
نویسندگان
چکیده
منابع مشابه
Proof of Imperative Programs in Type Theory
Proofs of correctness of imperative programs are traditionally done in rst order frameworks derived from Hoare logic On the other hand correctness proofs of purely functional programs are almost always done in higher order logics In particular the realizability allow to extract correct functional programs from constructive proofs of existential formulae In this paper we establish a relation bet...
متن کاملA Standard Representation of Imperative Language Programs
Numerous research results in the areas of software measures and software tools are predicated on a particular programming language, or on some characterizations of a programming language. For example, numerous software measures have been de ned only for structured programming languages and several of the reported approaches to program testing de ne a speci c language. However, this proliferatio...
متن کاملSYMDIFF: A Language-Agnostic Semantic Diff Tool for Imperative Programs
In this paper, we describe SymDiff, a language-agnostic tool for equivalence checking and displaying semantic (behavioral) differences over imperative programs. The tool operates on an intermediate verification language Boogie, for which translations exist from various source languages such as C, C# and x86. We discuss the tool and the front-end interface to target various source languages. Fin...
متن کاملProof of Imperative Programs in Type TheoryJean - Christophe
Proofs of correctness of imperative programs are traditionally done in rst order frameworks derived from Hoare logic 8]. On the other hand, correctness proofs of purely functional programs are almost always done in higher order logics. In particular, the realizability 10] allow to extract correct functional programs from constructive proofs of existential formulae. In this paper, we establish a...
متن کاملA certified compiler for an imperative language
This paper describes the process of mechanically certifying a compiler with respect to the semantic speciication of the source and target languages. The proofs are performed in type theory using the Coq system. These proofs introduce speciic theoretical tools: fragmentation theorems and general induction principles. Un compilateur certiii pour un langage impratif RRsumm : Cet article ddcrit la ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2009
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1543135.1542514